Quantum Commitments and Signatures Without One-Way Functions

نویسندگان

چکیده

In the classical world, existence of commitments is equivalent to one-way functions. quantum setting, on other hand, are not known imply functions, but all constructions use at least Are functions really necessary for in world? this work, we show that non-interactive (for messages) with computational hiding and statistical binding exist if pseudorandom states exist. Pseudorandom sets efficiently generated their polynomially many copies computationally indistinguishable from same number Haar random [Ji, Liu, Song, CRYPTO 2018]. It even $$\textbf{BQP}=\textbf{QMA}$$ (relative a oracle) [Kretschmer, TQC 2021], which means can no quantum-secure cryptographic primitive exists. Our result therefore shows particular, function also consider digital signatures, fundamental primitives cryptography. We one-time secure signatures public keys result, (including functions)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secrecy without one-way functions

We show that some problems in information security can be solved without using one-way functions. The latter are usually regarded as a central concept of cryptography, but the very existence of one-way functions depends on difficult conjectures in complexity theory, most notably on the notorious “P 6= NP” conjecture. This is why cryptographic primitives that do not employ one-way functions are ...

متن کامل

4-Round Concurrent Non-Malleable Commitments from One-Way Functions

How many rounds and which computational assumptions are needed for concurrent nonmalleable commitments? The above question has puzzled researchers for several years. Recently, Pass in [TCC 2013] proved a lower bound of 3 rounds when security is proven through black-box reductions to falsifiable assumptions. On the other side, positive results of Goyal [STOC 2011], Lin and Pass [STOC 2011] and G...

متن کامل

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions

How many rounds and which computational assumptions are needed for concurrent nonmalleable commitments? The above question has puzzled researchers for several years. Recently, Pass in [TCC 2013] proved a lower bound of 3 rounds when security is proven through black-box reductions to falsifiable assumptions. On the other side, positive results of Goyal [STOC 2011], Lin and Pass [STOC 2011] and G...

متن کامل

Concurrent Non-Malleable Commitments from One-way Functions

We show the existence of concurrent non-malleable commitments based on the existence one-way functions. Our proof of security only requires the use of black-box techniques, and additionally provides an arguably simplified proof of the existence of even stand-alone secure non-malleable commitments. Cornell University, E-Mail: [email protected] Cornell University, E-Mail: [email protected]...

متن کامل

Secure multiparty computation without one-way functions

We describe protocols for secure computation of the sum, product, and some other functions of two or more elements of an arbitrary constructible ring, without using any one-way functions. One of the new inputs that we offer here is that, in contrast with other proposals, we conceal intermediate results of a computation. For example, when we compute the sum of k numbers, only the final result is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-15802-5_10